Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling
نویسندگان
چکیده
A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial point is that the analysis does not verify that an (abstract) goal does not lead to suspension but rather it infers (abstract) goals which do not lead to suspension.
منابع مشابه
Cv of Dr. Jan-georg Smaus 1.1 Logic Programming
Verification of logic programs with dynamic scheduling. My first work in this area was on programs using delay declarations, in particular, proving termination and absence of runtime errors for such programs [5, 6, 1, 28, 33]. I have developed a more abstract view of dynamic scheduling by defining the so-called input-consuming derivations [8, 28, 32, 34]. More powerful termination conditions we...
متن کاملDeclarative Semantics of Input Consuming Logic Programs
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been introduced to describe dynamic scheduling while abstracting from the technical details. In this paper we review and compare the different proposals given in [?], [?] and [?] for denotational semantics of programs with ...
متن کاملNurse rostering using fuzzy logic: A case study
In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...
متن کاملOptimization of Logic Programs with Dynamic Scheduling Mar a Garc a De
Dynamic scheduling increases the expressive power of logic programming languages, but also introduces some overhead. In this paper we present two classes of program transformations designed to reduce this additional overhead, while preserving the operational semantics of the original programs , modulo ordering of literals woken at the same time. The rst class of transformations simpliies the de...
متن کاملGoal Dependent vs. Goal Independent Analysis of Logic Programs
Abs t r ac t . Goal independent analysis of logic programs is commonly discussed in the context of the bottom-up approach. However, while the literature is rich in descriptions of top-down analysers and their application, practical experience with bottom-up analysis is still in a preliminary stage. Moreover, the practical use of existing top-down frameworks for goal independent analysis has not...
متن کامل